2 PHILIPPE BAPTISTE AND ANTOINE JOUGLETProblem Complexity
نویسنده
چکیده
منابع مشابه
Lower Bounds for Parallel Machine Scheduling Problems
We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to th...
متن کاملThomas_pages 1..6
Nicolas Thomas,* Holger Sierks, Cesare Barbieri, Philippe L. Lamy, Rafael Rodrigo, Hans Rickman, Detlef Koschny, Horst Uwe Keller, Jessica Agarwal, Michael F. A'Hearn, Francesco Angrilli, Anne-Therese Auger, M. Antonella Barucci, Jean-Loup Bertaux, Ivano Bertini, Sebastien Besse, Dennis Bodewits, Gabriele Cremonese, Vania Da Deppo, Björn Davidsson, Mariolino De Cecco, Stefano Debei, Mohamed Ram...
متن کاملA Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. We introduce new lower bounds and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. Computational results show that the proposed approach outperforms the best known proc...
متن کاملOn Minimizing Total Tardiness in a Serial Batching Problem
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch| P Ti is known to be NP-Hard in the ordinary sense. In this paper we show that ...
متن کاملDominance-Based Heuristics for One-Machine Total Cost Problems
We study the one-machine problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known greedy heuristic algorithms from the literature. Fina...
متن کامل